منابع مشابه
Ranking with Adaptive Neighbors
Retrieving the most similar objects in a large-scale database for a given query is a fundamental building block in many application domains, ranging from web searches, visual, cross media, and document retrievals. Stateof-the-art approaches have mainly focused on capturing the underlying geometry of the data manifolds. Graphbased approaches, in particular, define various diffusion processes on ...
متن کاملRandom Forests and Adaptive Nearest Neighbors
In this paper we study random forests through their connection with a new framework of adaptive nearest neighbor methods. We first introduce a concept of potential nearest neighbors (k-PNN’s) and show that random forests can be seen as adaptively weighted k-PNN methods. Various aspects of random forests are then studied from this perspective. We investigate the effect of terminal node sizes and...
متن کاملAdaptive Submodular Ranking
We study a general stochastic ranking problem where an algorithm needs to adaptively select a sequence of elements so as to “cover” a random scenario (drawn from a known distribution) at minimum expected cost. The coverage of each scenario is captured by an individual submodular function, where the scenario is said to be covered when its function value goes above some threshold. We obtain a log...
متن کاملAdaptive Sampling for Coarse Ranking
We consider the problem of active coarse ranking, where the goal is to sort items according to their means into clusters of prespecified sizes, by adaptively sampling from their reward distributions. This setting is useful in many social science applications involving human raters and the approximate rank of every item is desired. Approximate or coarse ranking can significantly reduce the numbe...
متن کاملAdaptive Sampling for Clustered Ranking
We consider the problem of sequential or active clustered ranking, where the goal is to sort items according to their means into clusters of pre-specified sizes, by adaptively sampling from their reward distributions. This setting is useful in many social science applications, where an approximate rank of every item is desired. In contrast, a complete ranking of the items requires a large numbe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Tsinghua Science and Technology
سال: 2017
ISSN: 1007-0214
DOI: 10.23919/tst.2017.8195354